A general purpose sparse matrix parallel solvers package

نویسندگان

  • Chris H. Q. Ding
  • Robert D. Ferraro
چکیده

A parallel solvers package of three solvers with a unified user interface is developed for solving a range of sparse symmetric complex linear systems arising from disc~tization of partial differential equations based on unstructu~d meshs using finite element, finite difference and finite volume analysis. Once the data interface is set up, the package constructs the sparse symmetric complex matrix, and solves the linear system by the method chosen by the user, either a preconditioned hi-conjugate gra-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernels for Distributed Memory Sparse Iterative Solvers ?

Domain Decomposition techniques constitute an important class of methods especially appropriate in a parallel computing environment, but only a few general purpose codes based on these techniques have been developed so far. In this work, we attempt to develop not only algorithms but also software libraries and tools to help in the parallel implementation of such techniques. These algorithms and...

متن کامل

P-sparslib: a Portable Library of Distributed Memory Sparse Iterative Solvers

Domain Decomposition techniques constitute an important class of methods which are especially appropriate in a parallel computing environment. However, few general purpose computational codes based on these techniques have been developed so far. In this paper, we propose one such solver developed around the idea of `distributed sparse matrices'. We explore issues related to data structures for ...

متن کامل

Comparison of Direct and Iterative Sparse Linear Solvers for Power System Applications on Parallel Computing Platforms

This paper presents a performance comparison of sparse linear solvers based on iterative and direct methods for power system applications implemented on parallel computing platform. The iterative sparse linear solver evaluated in this paper is based on the conjugate gradient algorithm with a Jacobi pre-conditioner executed on a general purpose graphic processing unit (GPGPU). The direct solvers...

متن کامل

Parallel Block-Diagonal-Bordered Sparse Linear Solvers for Electrical Power System Applications

Research is ongoing that examines parallel direct block-diagonal-bordered sparse linear solvers for irregular sparse matrix problems derived from electrical power system applications. Parallel block-diagonal-bordered sparse linear solvers exhibit distinct advantages when compared to current general parallel direct sparse matrix solvers. Our research shows that actual power system matrices can b...

متن کامل

Hybrid-Parallel Sparse Matrix–Vector Multiplication and Iterative Linear Solvers with the communication library GPI

We present a library of Krylov subspace iterative solvers built over the PGAS-type communication layer GPI. The hybrid pattern is here the appropriate choice to reveal the hierarchical parallelism of clusters with multiand manycore nodes. Our approach includes asynchronous communication and differs in many aspects from the classical one. We first present the GPI-based implementation of the spar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995